Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
نویسنده
چکیده
We investigate the parameterized complexity of computing an outcome of the Kemeny rule in judgment aggregation, providing the first parameterized complexity results for this problem for any judgment aggregation procedure. As parameters, we consider (i) the number of issues, (ii) the maximum size of formulas used to represent issues, (iii) the size of the integrity constraint used to restrict the set of feasible opinions, (iv) the number of individuals, and (v) the maximum Hamming distance between any two individual opinions, as well as all possible combinations of these parameters. We provide parameterized complexity results for two judgment aggregation frameworks: formula-based judgment aggregation and constraint-based judgment aggregation. Whereas the classical complexity of computing an outcome of the Kemeny rule in these two frameworks coincides, the parameterized complexity
منابع مشابه
Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young
Judgment aggregation is a collective decision making framework where the opinions of a group of agents is combined into a collective opinion. This can be done using many different judgment aggregation procedures. We study the computational complexity of computing the group opinion for several of the most prominent judgment aggregation procedures. In particular, we show that the complexity of th...
متن کاملParameterized Enumeration of Neighbour Strings and Kemeny Aggregations
In this thesis, we consider approaches to enumeration problems in the parameterized complexity setting. We obtain competitive parameterized algorithms to enumerate all, as well as several of, the solutions for two related problems Neighbour String and Kemeny Rank Aggregation. In both problems, the goal is to find a solution that is as close as possible to a set of inputs (strings and total orde...
متن کاملComputing Kemeny Rankings, Parameterized by the Average KT-Distance
The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Unfortunately, the problem is NP-hard. Extending our previous work [AAIM 2008], we show that the Kemeny score of an election can be computed efficiently whenever the average pairwise distance between two input votes is not too large. In other words, Kemeny Score is fixed-parameter tractable wi...
متن کاملComplexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure
An important criterium for social choice methods is their resistance against various types of strategic behavior. Seminal results in the social choice literature indicate that absolute resistance is in many cases impossible. For this reason, it has often been argued that computational intractability could be used as an obstruction for strategic behavior for different procedures. In this paper, ...
متن کاملParameterized Complexity Results for Agenda Safety in Judgment Aggregation
Many problems arising in computational social choice are of high computational complexity, and some are located at higher levels of the Polynomial Hierarchy. We argue that a parameterized complexity analysis provides valuable insight into the factors contributing to the complexity of these problems, and can lead to practically useful algorithms. As a case study, we consider the problem of agend...
متن کامل